Algorithms of distributed task allocation for cooperative agents
نویسندگان
چکیده
منابع مشابه
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routing problems where several agents need to visit targets simultaneously, for example, to move obstacles out of the way cooperatively. First, we propose reaction functions as a novel way of characterizing the costs of age...
متن کاملCentralized and Distributed Algorithms for a Cooperative Carrying Task
Many useful tasks require both mobility and manipulation — one or more mobile robots must move to a given location and perform some task with an object there. Our research has focused on mobile robots with nonprehensile (i.e., nongrasping) manipulators. Such manipulators are mechanically simpler than their prehensile counterparts and have the additional advantage of being able to manipulate a w...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملDistributed Task Scheduling and Allocation Using Genetic Algorithms
As complexity and size of projects increase so do the problems associated with the scheduling and management of the design, manufacturing and assembly processes. In the context of large projects the ability to optimise the scheduling and allocation of these processes can also aid in tendering for contract as well as the management of the project itself. Many large projects will be constructed a...
متن کاملTask Coordination for Non-cooperative Planning Agents
We consider task planning problems where a number of noncooperative agents have to work on a joint problem. Such a problem consists in completing a set of interdependent, hierarchically ordered tasks. Each agent is assigned a subset of tasks to perform for which it has to construct a plan. Since the agents are non-cooperative, they insist on planning independently and do not want to revise thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00175-3